Three-dimensional strong convexity and visibility
نویسندگان
چکیده
We define the notions of strong convexity and strong visibility. These notions generalize standard convexity and visibility, as well as several types of nontraditional convexity, such as iso-oriented rectangles and C-oriented polygons. We explore the properties of strong convexity and strong visibility in two and three dimensions. In particular, we establish analogs of the following properties of standard convex sets: • Every two points of a convex set are visible to each other. • The intersection of convex sets is a convex set. • For every point in the boundary of a convex set, there exists a supporting plane through this point. • A closed convex set in three dimensions is the intersection of all halfspaces that contain it.
منابع مشابه
Computational Problems in Strong Visibility
Strong visibility is a generalization of standard visibility, defined with respect to a fixed set of line orientations. We investigate computational properties of this generalized visibility, as well as the related notion of strong convexity. In particular, we describe algorithms for the following tasks: 1. Testing the strong visibility of two points in a polygon and the strong convexity of a p...
متن کاملPlanar Strong Visibility
The study of nontraditional notions of visibility and convexity is a fruitful branch of geometry, which has found applications in vlsi design, graphics, and motion planning. Researchers have investigated multiple variations of these notions, including orthogonal, finitely oriented, and restricted-orientation visibility and convexity, as well as nesw and link convexity. Rawlins introduced the no...
متن کاملEpileptic seizure detection based on The Limited Penetrable visibility graph algorithm and graph properties
Introduction: Epileptic seizure detection is a key step for both researchers and epilepsy specialists for epilepsy assessment due to the non-stationariness and chaos in the electroencephalogram (EEG) signals. Current research is directed toward the development of an efficient method for epilepsy or seizure detection based the limited penetrable visibility graph (LPVG) algorith...
متن کاملConstant Nullspace Strong Convexity and Fast Convergence of Proximal Methods under High-Dimensional Settings
State of the art statistical estimators for high-dimensional problems take the form of regularized, and hence non-smooth, convex programs. A key facet of these statistical estimation problems is that these are typically not strongly convex under a high-dimensional sampling regime when the Hessian matrix becomes rankdeficient. Under vanilla convexity however, proximal optimization methods attain...
متن کاملOn starshapedness in products of interval spaces
Later a bouquet of Krasnosel 'skii-type theorems was discovered; see [1,2, 3, 4,16,17]. Apart from the usual line segment visibility and starshapedness several other notions of starshaped set and visibility have been investigated in the past years: d-starshaped sets in metric and normed spaces [14,15,16,17], starshaped sets in graphs [14,171, staircase visibility [5,10,12], rectangular visibili...
متن کامل